0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : appext
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n138.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 16:07:39 CST 2018
0.00/0.20	% done 5 iterations in 0.004s
0.00/0.20	% SZS status Theorem for 'stdin'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(zf_stmt_6, conjecture,
0.00/0.20	  ((![X]: (app_encode_app($i,$i,f,X) = app_encode_app($i,$i,g,X))) =>
0.00/0.20	   (app_encode_app(app_encode_fun($i,$i),$o,p,f) =>
0.00/0.20	    app_encode_app(app_encode_fun($i,$i),$o,p,g)))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    ((![X]: (app_encode_app($i,$i,f,X) = app_encode_app($i,$i,g,X))) =>
0.00/0.20	     (app_encode_app(app_encode_fun($i,$i),$o,p,f) =>
0.00/0.20	      app_encode_app(app_encode_fun($i,$i),$o,p,g))))).
0.00/0.20	tff('0', plain, ~ app_encode_app(app_encode_fun($i, $i), $o, p, g),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('1', plain,
0.00/0.20	    ![X4]: app_encode_app($i, $i, f, X4) = app_encode_app($i, $i, g, X4),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff(zf_stmt_2, axiom,
0.00/0.20	  (![X:app_encode_fun(Alpha,Beta),Y:app_encode_fun(Alpha,Beta)]:
0.00/0.20	     ((![Z:Alpha]:
0.00/0.20	         (app_encode_app(Alpha,Beta,X,Z) = app_encode_app(Alpha,Beta,Y,Z))) =>
0.00/0.20	      (X = Y)))).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X0 : $tType, X1 : $tType, X2 : app_encode_fun(X0, X1), 
0.00/0.20	      X3 : app_encode_fun(X0, X1)]:
0.00/0.20	      (X3 = X2
0.00/0.20	       | app_encode_app(X0, X1, X3, sk_Z(X1, X0, X2, X3))
0.00/0.20	          != app_encode_app(X0, X1, X2, sk_Z(X1, X0, X2, X3))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_2])).
0.00/0.20	tff('3', plain,
0.00/0.20	    ![X0 : app_encode_fun($i, $i)]:
0.00/0.20	      (app_encode_app($i, $i, f, sk_Z($i, $i, X0, g))
0.00/0.20	        != app_encode_app($i, $i, X0, sk_Z($i, $i, X0, g))
0.00/0.20	       | g = X0),
0.00/0.20	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.20	tff('4', plain, g = f, inference('eq_res', [status(thm)], ['3'])).
0.00/0.20	tff('5', plain, app_encode_app(app_encode_fun($i, $i), $o, p, f),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('6', plain, ~ $true, inference('demod', [status(thm)], ['0', '4', '5'])).
0.00/0.20	tff('7', plain, $false, inference('simplify', [status(thm)], ['6'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
